Studying Solutions of Traveling Salesman Problem with Hybrid Particle Swarm Optimization
نویسندگان
چکیده
This paper presents the application of the PSO (Particle Swarm Optimization) as a tool to solve the Traveling Salesman Problem. The proposed application consists of using a technique based on Artificial Intelligent – AI. It is based in the simulation of social interaction between individuals of a population. Here, each element of population moves in the hyper-space and they are attracted by positions that they considers promising. Key-Words: Artificial Intelligence, Swarm Intelligence, Traveling Salesman Problem, Optimization
منابع مشابه
Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملDiscrete Particle Swarm Optimization for TSP based on Neighborhood
Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal solutions for continuous optimization problems. Updating kinetic equations for particle swarm optimization algorithm are improved to solve traveling salesman problem (TSP) based on problem characteristics and discrete variable. Those strategies which are named heuristic factor, reversion mutant and adaptive no...
متن کاملA Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem
Available online 24 March 2009
متن کامل